Longest Paths in Circular Arc Graphs
نویسندگان
چکیده
We show that all maximum length paths in a connected circular arc graph have non–empty intersection.
منابع مشابه
A Note on Longest Paths in Circular Arc Graphs
As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014) 335–341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput. 13 (2004) 311–317], which states that the intersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap.
متن کاملComputing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in Ioannidou et al. (2011) [19] with running ti...
متن کاملComputing and Counting the Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in [20] with running time O(n) on a graph with ...
متن کاملPolynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-widthh
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give nO(w)-time algorithms on graphs of mim-width at most w, when given a decomposition, for the following problems: Longest Induced Path, Induced Disjoint Paths and H-Induced Topological Minor for fixed H. Our results imply ...
متن کاملPolynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give nO(w)-time algorithms on graphs of mim-width at most w, when given a decomposition, for the following problems: Longest Induced Path, Induced Disjoint Paths and H-Induced Topological Minor for fixed H. Our results imply ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2004